| 翻訳と辞書 |
| Lance Fortnow ： ウィキペディア英語版 |
Lance Fortnow
Lance Jeremy Fortnow (born August 15, 1963) is a computer scientist known for major results in computational complexity and interactive proof systems. He currently chairs the School of Computer Science at Georgia Tech.
==Biography==
Lance Fortnow received a doctorate in Applied Mathematics from MIT in 1989,〔(Lance Fortnow ) at the Mathematics Genealogy Project〕 supervised by Michael Sipser. Since graduation, he's served on the faculty of the University of Chicago (1989-1999, 2003-2007), Northwestern University (2008-2012), and most recently the Georgia Institute of Technology (2012–present) as chair of the School of Computer Science.〔(Northwestern University Electrical Engineering and Computer Science Department Faculty )〕
Fortnow was the founding editor-in-chief of the journal ACM Transaction on Computation Theory.〔(ACM Transaction on Computation Theory )〕 He was the chair of ACM SIGACT〔(ACM SIGACT )〕 and succeeded by Paul Beame. He was the chair of the IEEE Conference on Computational Complexity〔(IEEE Conference on Computational Complexity )〕 from 2000 to 2006. In 2003, Fortnow began one of the first blogs devoted to theoretical computer science〔(Computational Complexity Weblog )〕 and has written for it since then; since 2007 he has had a co-blogger, William Gasarch. In September 2009, Fortnow brought mainstream attention to complexity theory when he published an article surveying the progress made in the P versus NP problem in the Communications of the Association of Computing Machinery.〔(J. Markoff. Prizes Aside, the P-NP Puzzler Has Consequences. ''The New York Times'' 7 Oct. 2009. )〕〔(L. Fortnow. The Status of the P Versus NP Problem. ''Communications of the ACM'' 9 (2009). )〕
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Lance Fortnow」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|